Gd-Distance of Wreath Product of Graphs
نویسندگان
چکیده
Let G = (V, E) be a simple connected graph. The geodesic distance between two vertices u, v in is the length terms of number edges shortest path vertices. In this paper, we determine Gd-distance wreath product graphs. Using formulae obtained here, have found exact value some classes
منابع مشابه
Distance-based topological indices of tensor product of graphs
Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...
متن کاملProduct version of reciprocal degree distance of composite graphs
A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.
متن کاملGeneralized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کامل-Factorization of the symmetric digraph of wreath product of graphs
In this paper, we show that the necessary and sufficient condition for the existence of an e Sk-factorization of (Cm ◦ Kn)∗ is n ≡ 0 (mod k(k − 1)), for all m > 3. In fact, our result together with a result of Ushio gives a complete solution for the existence of an e Sk-factorization of (Cm ◦Kn)∗ for all m ≥ 3. Further, we have obtained some necessary or sufficient conditions for the existence ...
متن کاملdegree distance and gutman index of corona product of graphs
in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of physics
سال: 2021
ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']
DOI: https://doi.org/10.1088/1742-6596/1947/1/012033